#define _CRT_SECURE_NO_WARNINGS
#include "sort.h"
void SortPrint(int* a, int n)
{
	for (int i = 0; i < n; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
}
void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	assert(a1);
	int* a2 = (int*)malloc(sizeof(int) * N);
	assert(a2);
	int* a3 = (int*)malloc(sizeof(int) * N);
	assert(a3);
	int* a4 = (int*)malloc(sizeof(int) * N);
	assert(a4);
	int* a5 = (int*)malloc(sizeof(int) * N);
	assert(a5);
	int* a6 = (int*)malloc(sizeof(int) * N);
	assert(a6);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
	}
	int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	SelectSort(a3, N);
	int end3 = clock();
	
	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	
	int begin5 = clock();
	QuickSort(a5, 0, N - 1);
	int end5 = clock();
	
	int begin6 = clock();
	//MergeSort(a6, N);
	int end6 = clock();
	
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
}
void SortTest()
{
	int a[] = { 3,4,103,67,4,5,33,95,1,2 };
	//InsertSort(a, 10);
	//SortPrint(a, 10);

	//ShellSort(a, 10);
	//SortPrint(a, 10);

	//SelectSort(a, 10);
	//SortPrint(a, 10);

	//BubbleSort(a, 10);
	//SortPrint(a, 10);

	//HeapSort(a, 10);
	//SortPrint(a, 10);

	//Part1Sort(a, 0, 9);
	//SortPrint(a, 10);

	//QuickSort(a, 0, 9);
	//SortPrint(a, 10);
	QuickSortNonR(a, 0, 9);
	SortPrint(a, 10);
}
void MergeSorttest()
{
	int a[] = { 3,7,4,9,5,3,6,5,1 };
	MergeSort(a, 9);
	for (int i = 0; i < 9; i++)
	{
		printf("%d ", a[i]);
	}
}
void MergeSortNonRtest()
{
	int a[] = { 3,7,4,9,5,3,6,5,1 };
	MergeSortNonR(a, 9);
	for (int i = 0; i < 9; i++)
	{
		printf("%d ", a[i]);
	}
}

void CountSortTest()
{
	int a[] = { 3,7,4,9,5,3,6,5,1 };
	CountSort(a, 9);
	for (int i = 0; i < 9; i++)
	{
		printf("%d ", a[i]);
	}
}

int main()
{
	//MergeSorttest();
	//printf("\n");
	//MergeSortNonRtest();
	//printf("\n");
	//CountSortTest();
	SortTest();
	return 0;
}